Data Based Regularization Matrices for the Tikhonov-Phillips Regularization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data Based Regularization Matrices for the Tikhonov-Phillips Regularization

In Tikhonov-Phillips regularization of general form the given ill-posed linear system is replaced by a Least Squares problem including a minimization of the solution vector x, relative to a seminorm ‖Lx‖2 with some regularization matrix L. Based on the finite difference matrix Lk, given by a discretization of the first or second derivative, we introduce the seminorm ‖LkD x̃ x‖2 where the diagona...

متن کامل

Fast CG-Based Methods for Tikhonov-Phillips Regularization

Tikhonov–Phillips regularization is one of the best-known regularization methods for inverse problems. A posteriori criteria for determining the regularization parameter α require solving (∗) (AA+ αI)x = Ay for different values of α. We investigate two methods for accelerating the standard cg-algorithm for solving the family of systems (∗). The first one utilizes a stopping criterion for the cg...

متن کامل

A Regularization Parameter for Nonsmooth Tikhonov Regularization

In this paper we develop a novel criterion for choosing regularization parameters for nonsmooth Tikhonov functionals. The proposed criterion is solely based on the value function, and thus applicable to a broad range of functionals. It is analytically compared with the local minimum criterion, and a posteriori error estimates are derived. An efficient numerical algorithm for computing the minim...

متن کامل

Tikhonov Regularization

An important issue in quantitative nance is model calibration. The calibration problem is the inverse of the pricing problem. Instead of computing prices in a model with given values for its parameters, one wishes to compute the values of the model parameters that are consistent with observed prices. Now, it is well-known by physicists that such inverse problems are typically ill-posed. So, if ...

متن کامل

Nonstationary Iterated Tikhonov Regularization

A convergence rate is established for nonstationary iterated Tik-honov regularization, applied to ill-posed problems involving closed, densely deened linear operators, under general conditions on the iteration parameters. It is also shown that an order-optimal accuracy is attained when a certain a posteriori stopping rule is used to determine the iteration number.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: PAMM

سال: 2012

ISSN: 1617-7061

DOI: 10.1002/pamm.201210310